Syntactic complexity of suffix-free languages
نویسندگان
چکیده
منابع مشابه
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
متن کاملUpper Bound on Syntactic Complexity of Suffix-Free Languages
We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n − 1) + n − 2 for n > 6. Since this bound is known to be reachable, this settles the problem. We also reduce the alphabet of the witness languages reaching this bound to five letters ins...
متن کاملComplexity of Suffix-Free Regular Languages
We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language L is the number of left quotients of L; this is the same as the state complexity of L, which is the number of states in a minimal deterministic finite automaton (DFA) accepting L. A regular language L′ is a dialect of a regular language L if it differs only slightly from L (for...
متن کاملSyntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We...
متن کاملSyntactic Complexity of Bifix-Free Languages
We study the properties of syntactic monoids of bifix-free regular languages. In particular, we solve an open problem concerning syntactic complexity: We prove that the car-dinality of the syntactic semigroup of a bifix-free language with state complexity n is at most (n−1) n−3 +(n−2) n−3 +(n−3)2 n−3 for n 6. The main proof uses a large construction with the method of injective function. Since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2018
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.08.014